Protocol indepedence through disjoint encryption under Exclusive-OR
نویسنده
چکیده
Multi-protocol attacks due to protocol interaction has been a notorious problem for security. Gutman-Thayer proved that they can be prevented by ensuring that encrypted messages are distinguishable across protocols, under a free algebra [1]. In this paper, we prove that a similar suggestion prevents these attacks under commonly used operators such as Exclusive-OR, that induce equational theories, breaking the free algebra assumption.
منابع مشابه
Combining Algorithms for Deciding Knowledge in Security Protocols
In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic functions (encryption, exclusive or, . . . ). The analysis of cryptographic protocols requires a precise understanding of the attacker knowledge. Two standard notions are usually used: deducibility and indistinguishability. Those no...
متن کاملS ¸ Tefan Ciobâc˘ A, Véronique Cortier Protocol Composition for Arbitrary Primitives Protocol Composition for Arbitrary Primitives
We study the composition of security protocols when protocols share secrets such as keys. We show (in a Dolev-Yao model) that if two protocols use disjoint cryptographic primitives, their composition is secure if the individual protocols are secure, even if they share data. Our result holds for any cryptographic primitives that can be modeled using equational theories, such as encryption, signa...
متن کاملIntruder Deduction for the Equational Theory of Exclusive-or with Distributive Encryption *
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocols are based on rewriting techniques and automated deduction in order to implement or mimic the process calculus describing the execution of a protocol. We are interested in the intruder deduction problem, that is the ...
متن کاملStrengthening the Encryption Mechanism in WEP Protocol
Wi-Fi is serving as a standard for broadband connectivity in homes, offices, and at many public locations. WEP is a security protocol for WLANs designed to give security equivalent to that provided on Wired Networks. It is a framework that uses RC4 encryption algorithm. Many flaws had been discovered in the RC4 algorithm by the experts. In the RC4 the encryption is performed by a ‘bit-by-bit’ ‘...
متن کاملProtocol Independence through Disjoint Encryption
One protocol (called the primary protocol) is independent of other protocols (jointly called the secondary protocol) if the question whether the primary protocol achieves a security goal never depends on whether the secondary protocol is in use. In this paper, we use multiprotocol strand spaces ([27], cf. [28]) to prove that two cryptographic protocols are independent if they use encryption in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1003.5384 شماره
صفحات -
تاریخ انتشار 2010